A proof procedure for adaptive logics

نویسنده

  • Peter Verdée
چکیده

In this paper I present a procedure that generates adaptive proofs for finally derivable adaptive logic consequences. The proof procedure for the inconsistency adaptive logic CLuNr is already presented in [10]. In this paper the procedure for CLuNm is presented and the results for both logics are generalized to all adaptive logics, on the presupposition that there exists a total proof procedure for lower limit logic derivability of the adaptive logic and a finite set of problem relevant abnormalities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Computational Aspects of Inconsistency-Adaptive Logics

This paper concerns a goal directed proof procedure for the propositional fragment of the adaptive logic ACLuN1. The procedure forms an algorithm for final derivability and may easily be generalized for the propositional fragment of all flat adaptive logics. The aim is to articulate a procedure that, if extended to the predicative level, provides criteria for

متن کامل

A procedural criterion for final derivability in inconsistency-adaptive logics

This paper concerns a (prospective) goal directed proof procedure for the propositional fragment of the inconsistency-adaptive logic ACLuN1. At the propositional level, the procedure forms an algorithm for final derivability. If extended to the predicative level, it provides a criterion for final derivability. This is essential in view of the absence of a positive test. The procedure may be gen...

متن کامل

Hierarchic adaptive logics

This paper discusses the proof theory, semantics and meta-theory of a class of adaptive logics, called hierarchic adaptive logics. Their specific characteristics are illustrated throughout the paper with the use of one exemplary logic HK, an explicans for reasoning with prioritized belief bases. A generic proof theory for these systems is defined, together with a less complex proof theory for a...

متن کامل

On a Partial Decision Method for Dynamic Proofs

This paper concerns a goal directed proof procedure for the propositional fragment of the adaptive logic ACLuN1. The procedure forms an algorithm for final derivability and may easily be generalized for the propositional fragment of all flat adaptive logics. The aim is to articulate a procedure that, if extended to the predicative level, provides criteria for

متن کامل

A New Proof of FDR Control Based on Forward Filtration

For multiple testing problems, Benjamini and Hochberg (1995) proposed the false discovery rate (FDR) as an alternative to the family-wise error rate (FWER). Since then, researchers have provided many proofs to control the FDR under different assumptions. Storey et al. (2004) showed that the rejection threshold of a BH step-up procedure is a stopping time with respect to the reverse filtration g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2013